PERFORMANCE ANALYSIS OF COMPUTER COMMUNICATION NETWORKS VIA RANDOM ACCESS CHANNELS bY

The field of computer communication networks has grown very rapidly in the past few years. One way to communicate is viamultiple access broadcast channels. A new class of random access schemes referred to as the Mp-persistent CSMA scheme is proposed. It incorporates the nonpersistent CSMA scheme and l-persistent CSMA scheme, both slotted and unslotted versions, as its special cases with p=O and 1, respectively. The performance of the "s-persistent CSMA scheme under packet switching is analyzed and compare with other random access schemes. By dynamically adjusting p, the unslotted version can achieve better performance in both throughput and delay than the currently available unslotted CSMA schemes under packet switching. Furthermore, the performance of various random access shcemes under message switching is analyzed and compared with that under packet switching. In both slotted and unslotted versions of the MC-persistent CSMA scheme, the performance under message switching is superior to that under packet switching in the sense that not only the channel capacity is larger but also the average number of retransmissions per successful message under message switching is smaller than that per successful packet under packet switching. In dynamic reservation schemes, message switching leads to larger channel capacity. However, in both slotted and unslotted versions of the ALOHA scheme, the channel capacity is reduced when message switching is used instead of packet switching. This phenomenon may also happen in the Mp-persistent CSMA scheme as p deviates from 0 to 1 for certain distributions of message length. Hence, the performance under message switching may be superior to or inferior to that under packet switching i depending upon the random access scheme being used and the distribution of message length (usually a large coefficient of variation of message length implies a large degradation of channel capacity in this case) for certain random access schemes. Nevertheless, for radio channels, message switching can achieve larger channel capacity if appropriate CSMA schemes are used. A mixed strategy which is a combination of message switching and packet switching is proposed t-e'limprove the performance of a point to point computer communication network when its terminal access networks communicate via highly utilized radio channels.